The subspace iteration method in protein normal mode analysis

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The subspace iteration method in protein normal mode analysis

Normal mode analysis plays an important role in relating the conformational dynamics of proteins to their biological function. The subspace iteration method is a numerical procedure for normal mode analysis that has enjoyed widespread success in the structural mechanics community due to its numerical stability and computational efficiency in calculating the lowest normal modes of large systems....

متن کامل

The subspace iteration method – Revisited

The objective in this paper is to present some recent developments regarding the subspace iteration method for the solution of frequencies and mode shapes. The developments pertain to speeding up the basic subspace iteration method by choosing an effective number of iteration vectors and by the use of parallel processing. The subspace iteration method lends itself particularly well to shared an...

متن کامل

An Accelerated Subspace Iteration Method

The analysis of a number of physical phenomena requires the solution of an eigenproblem. It is therefore natural that with the increased use of computational methods operating on discrete representations of physical problems the development of efficient algorithms for the calculation of eigenvalues and eigenvectors has attracted much attention [l]-[8]. In particular, the use of finite element a...

متن کامل

The Bathe subspace iteration method enriched by turning vectors

Article history: Received 29 December 2016 Accepted 19 February 2017 Available online 29 March 2017

متن کامل

A new subspace iteration method for the algebraic Riccati equation

We consider the numerical solution of the continuous algebraic Riccati equation AX +XA−XFX +G = 0, with F = F , G = G of low rank and A large and sparse. We develop an algorithm for the low rank approximation of X by means of an invariant subspace iteration on a function of the associated Hamiltonian matrix. We show that the sought after approximation can be obtained by a low rank update, in th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Chemistry

سال: 2010

ISSN: 0192-8651,1096-987X

DOI: 10.1002/jcc.21250